Network Design Problems with Piecewise Linear Cost Functions
نویسنده
چکیده
ix Introduction xi On the General Framework and Piecewise Linear Cost Functions . . . . . . . . . . xi The Structure of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii 1 A Literature Review on Discrete Facility Location with Non-Standard Cost Functions 1 1.
منابع مشابه
Network Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملNetwork Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملVariable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Network flow problems with non-convex piecewise linear cost structures arise in many application areas, most notably in freight transportation and supply chain management. In the present paper, we consider mixed-integer programming (MIP) formulations of a generic multi-commodity network flow problem with piecewise linear costs. The formulations we study are based on variable disaggregation tech...
متن کاملPolynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
We consider the problem of minimizing a separable convex objective function over the linear space given by system Mx = 0 with M a totally unimodular matrix. In particular, this generalizes the usual minimum linear cost circulation and co-circulation problems in a network, and the problems of determining the Euclidean distance from a point to the perfect bipartite matching polytope and the feasi...
متن کاملLink Capacity Assignment in Packet-Switched Networks: The Case of Piecewise Linear Concave Cost Function
In this paper, we study the link capacity assignment problem in packet-switched networks (CA problem) focusing on the case where link cost function is a piecewise linear concave function. This type of cost function arises in many communication network design problems such as those arising from developments in communication transmission technologies. It is already known that the method of link s...
متن کامل